Learning Disjunctive Logic Programs from Interpretation Transition
نویسندگان
چکیده
We present a new framework for learning disjunctive logic programs from interpretation transitions, called LFDT. It is a nontrivial extension to Inoue, Ribeiro and Sakama’s LF1T learning framework, which learns normal logic programs from interpretation transitions. Two resolutions for disjunctive rules are also presented and used in LFDT to simplify learned disjunctive rules.
منابع مشابه
Learning Datalog Programs from Input and Output
We present a new framework for learning disjunctive logic programs from interpretation transitions, called LFDT. It is a nontrivial extension to Inoue, Ribeiro and Sakama’s LF1T learning framework, which learns normal logic programs from interpretation transitions. Two resolutions for disjunctive rules are also presented and used in LFDT to simplify learned disjunctive rules.
متن کاملAbstract Disjunctive Answer Set Solvers
Disjunctive Answer Set Solvers Remi Brochenin1 and Yuliya Lierler2 and Marco Maratea3 Abstract. A fundamental task in answer set programming is to compute answer sets of logic programs. Answer set solvers are the programs that perform this task. The problem of deciding whether a disjunctive program has an answer set is Σ2 -complete. The high complexity of reasoning within disjunctive logic prog...
متن کاملLearning Logic Programs with Annotated Disjunctions
Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logic programming. In this paper we propose an algorithm for learning LPADs. The learning problem we consider consists in starting from a sets of interpretations annotated with their probability and finding one (or more) LPAD that assign to each interpretation th...
متن کاملReflective Autoepistemic Logic and Logic Programming
In this paper we show that reflexive autoepistemic logic of Schwarz is a particularly convenient modal formalism for studying properties of answer sets for logic programs with classical negation and disjunctive logic programs. Syntactical properties of logic programs imply that a natural interpretation of default logic in the logic of minimal knowledge (nonmonotonic S4F) provides also a modal r...
متن کاملExtended Well-Founded Semantics for Paraconsistent Logic Programs
This paper presents a declarative semantics of logic programs which possibly contain inconsistent information. We introduce a multi-valued interpretation of logic programs and present the extended well-founded semantics for paraconsistent logic programs. In this setting, a meaningful information is still available in the presence of an inconsistent information in a program and any fact which is...
متن کامل